A note on continuation problems
نویسندگان
چکیده
منابع مشابه
A note on symmetric duality in vector optimization problems
In this paper, we establish weak and strong duality theorems for a pair of multiobjective symmetric dual problems. This removes several omissions in the paper "Symmetric and self duality in vector optimization problem, Applied Mathematics and Computation 183 (2006) 1121-1126".
متن کاملA Note on Interactive Theorem Proving with Theorem Continuation Functions
A simple technique for using theorem continuation functions interactively with HOL's sub-goal package is presented. An interesting aspect of the technique is that it hinges on the existence of assignable variables in ML. Suppose we wish to prove a /\ b ==> b /\ a using HOL's subgoal package 1]: 1 #g "a /\ b ==> b /\ a" ;; "a /\ b ==> b /\ a" The natural proof is to assume the antecedent a /\ b ...
متن کاملA Note on Passepartout Problems
This note provides a methodological contribution to the allocation of joint revenues obtained from passepartouts. In a passepartout system a group of service providers offers a passepartout that allows its owners the use of specified services for an unlimited number of times during a fixed period of time. The corresponding allocation problem is then how to share the total joint revenues of the ...
متن کاملOn a New Homotopy Continuation Trajectory for Nonlinear Complementarity Problems
Most known continuation methods for P0 complementarity problems require some restrictive assumptions, such as the strictly feasible condition and the properness condition, to guarantee the existence and the boundedness of certain homotopy continuation trajectory. To relax such restrictions, we propose a new homotopy formulation for the complementarity problem based on which a new homotopy conti...
متن کاملA Note on Online Steiner Tree Problems
We introduce and study a new Steiner tree problem variation called the bursty Steiner tree problem where new nodes arrive into bursts. This is an online problem which becomes the well-known online Steiner tree problem if the number of nodes in each burst is exactly one and becomes the classical Steiner tree problem if all the nodes that need to be connected appear in a single burst. In undirect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Glasgow Mathematical Journal
سال: 1986
ISSN: 0017-0895,1469-509X
DOI: 10.1017/s0017089500006339